Counting K4-subdivisions
نویسندگان
چکیده
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of K4. As a generalization, we ask for the minimum number of K4-subdivisions that are contained in every 3connected graph on n vertices. We prove that there are Ω(n) such K4subdivisions and show that the order of this bound is tight for infinitely many graphs. We further prove that the computational complexity of the problem of counting the exact number of K4-subdivisions is #P -hard.
منابع مشابه
On a theorem of Sewell and Trotter
Sewell and Trotter proved that every connected α-critical graph that is not isomorphic to K1,K2 or an odd cycle contains a totally odd K4-subdivision. Their theorem implies an interesting min-max relation for stable sets in graphs without totally odd K4-subdivisions. In this note, we give a simpler proof of Sewell and Trotter’s theorem.
متن کاملCounting unlabelled toroidal graphs with no K33-subdivisions
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projectiveplanar graphs containing no K3,3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
متن کامل1 S ep 2 00 5 Counting unlabelled toroidal graphs with no K 3 , 3 - subdivisions Andrei Gagarin , Gilbert Labelle and Pierre Leroux
We provide a description of unlabelled enumeration techniques, with complete proofs, for graphs that can be canonically obtained by substituting 2-pole networks for the edges of core graphs. Using structure theorems for toroidal and projectiveplanar graphs containing no K3,3-subdivisions, we apply these techniques to obtain their unlabelled enumeration.
متن کاملFinding and Counting Small Induced Subgraphs Efficiently
We give two algorithms for listing all simplicial vertices of a graph running in time O(nα) and O(e2α/(α+1)) = O(e1.41), respectively, where n and e denote the number of vertices and edges in the graph and O(nα) is the time needed to perform a fast matrix multiplication. We present new algorithms for the recognition of diamond-free graphs (O(nα + e3/2)), claw-free graphs (O(e(α+1)/2)= O(e1.69))...
متن کاملWord-Representability of Face Subdivisions of Triangular Grid Graphs
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A face subdivision of a triangular grid graph is replacing some of its cells by plane copies of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015